A multiobjective evolutionary algorithm to find community structures based on affinity propagation
نویسندگان
چکیده
منابع مشابه
Method to find community structures based on information centrality.
Community structures are an important feature of many social, biological, and technological networks. Here we study a variation on the method for detecting such communities proposed by Girvan and Newman and based on the idea of using centrality measures to define the community boundaries [M. Girvan and M. E. J. Newman, Proc. Natl. Acad. Sci. U.S.A. 99, 7821 (2002)]. We develop an algorithm of h...
متن کاملA Novel Multiobjective Evolutionary Algorithm Based on Regression Analysis
As is known, the Pareto set of a continuous multiobjective optimization problem with m objective functions is a piecewise continuous (m - 1)-dimensional manifold in the decision space under some mild conditions. However, how to utilize the regularity to design multiobjective optimization algorithms has become the research focus. In this paper, based on this regularity, a model-based multiobject...
متن کاملA parallel attribute reduction algorithm based on Affinity Propagation clustering
As information technology is developing rapidly, massive and high dimensional data sets have appeared in abundance. The existing attribute reduction methods are encountering bottleneck problem of timeliness and spatiality. AP(Affinity Propagation) is an efficient and fast clustering algorithm for large dataset compared with the existing clustering algorithms. This paper discusses attribute clus...
متن کاملA new multiobjective evolutionary algorithm
The Pareto-based approaches have shown some success in designing multiobjective evolutionary algorithms. Their methods of fitness assignment are mainly from the information of dominated and nondominated individuals. On the top of the hierarchy of multiobjective evolutionary algorithms, the Strength Pareto Evolutionary Algorithm (SPEA) has been elaborately designed with this principle in mind. I...
متن کاملMultiobjective evolutionary algorithm based on multimethod with dynamic resources allocation
In the last two decades, multiobjective optimization has become main stream and various multiobjective evolutionary algorithms (MOEAs) have been suggested in the field of evolutionary computing (EC) for solving hard combinatorial and continuous multiobjective optimization problems. Most MOEAs employ single evolutionary operators such as crossover, mutation and selection for population evolution...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica A: Statistical Mechanics and its Applications
سال: 2016
ISSN: 0378-4371
DOI: 10.1016/j.physa.2016.02.020